منابع مشابه
Admission Control to Minimize Rejections
Admission control call control is a well studied online prob lem We are given a xed graph with edge capacities and must process a sequence of calls that arrive over time accepting some and rejecting others in order to stay within capacity limitations of the network In the standard theoretical formulation this problem is analyzed as a bene t problem the goal is to devise an online algorithm that...
متن کاملAdmission control to minimize
Admission control (call control) is a well-studied online problem. We are given a xed graph with edge capacities, and must process a sequence of calls that arrive over time, accepting some and rejecting others in order to stay within capacity limitations of the network. In the standard theoretical formulation, this problem is analyzed as a beneet problem: the goal is to devise an online algorit...
متن کاملCall Control with k Rejections
Given a set of connection requests (calls) in a communication network, the call control problem is to accept a subset of the requests and route them along paths in the network such that no edge capacity is violated, with the goal of rejecting as few requests as possible. We investigate the complexity of parameterized versions of this problem, where the number of rejected requests is taken as th...
متن کاملScheduling on a Single Machine to Minimize Total Flow Time with Job Rejections
We consider the problem of minimizing flow time on a single machine supporting preemption that can reject jobs at a cost. Even if all jobs have the same rejection cost, we show that no online algorithm can have competitive ratio better than (2+ √ 2)/2 ≈ 1.707 in general or e/(e− 1) ≈ 1.582 if all jobs are known to have the same processing time. We also give an optimal offline algorithm for unit...
متن کاملTo “ Private Information and Insurance Rejections ” (
THIS SUPPLEMENTAL MATERIAL CONTAINS FIVE APPENDIXES. Appendix A contains the proof of Theorem 1 and discusses Remark 1. Appendix B provides proofs for the lower bound approach discussed in Section 4.1. Appendix C discusses the data, including details for the covariate specifications and the sample selection. Appendix D discusses the empirical specification for the lower bound estimator, present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2004
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2004.10129085